Guided Stochastic Optimization for Motion Planning
نویسندگان
چکیده
منابع مشابه
Demonstration-Guided Motion Planning
We present demonstration-guided motion planning (DGMP), a new framework for planning motions for personal robots to perform household tasks. DGMP combines the strengths of sampling-based motion planning and robot learning from demonstrations to generate plans that (1) avoid novel obstacles in cluttered environments, and (2) learn and maintain critical aspects of the motion required to successfu...
متن کاملStochastic Extended LQR: Optimization-Based Motion Planning Under Uncertainty
We introduce a novel optimization-based motion planner, Stochastic Extended LQR (SELQR), which computes a trajectory and associated linear control policy with the objective of minimizing the expected value of a user-defined cost function. SELQR applies to robotic systems that have stochastic non-linear dynamics with motion uncertainty modeled by Gaussian distributions that can be stateand contr...
متن کاملVisual Techniques for User-Guided Motion Planning
Robotic motion planning is an ubiquitous field of study, with innumerable applications in science, engineering, and beyond. A majority of research has focused on fully automated strategies, which have led to great progress in confronting a variety of interesting scenarios. At its core, however, motion planning is simply infeasible for most complex problems. Automatic planners lack insight and c...
متن کاملAbstraction-Guided Sampling for Motion Planning
ion-guided Sampling for Motion Planning University of New Hampshire Department of Computer Science Technical Report 12-01 Scott Kiesel, Ethan Burns and Wheeler Ruml May 1, 2012 Abstraction-guided Sampling for Motion Planningion-guided Sampling for Motion Planning Scott Kiesel and Ethan Burns and Wheeler Ruml Abstract Motion planning in continuous space is a fundamental robotics problem that has...
متن کاملInteractive Human-Guided Optimization for Logistics Planning
Logistics planning is an important problem in industry, where goods have to be parceled appropriately to meet delivery dates or reduce shipping costs. This optimization problem is classically solved offline using standard algorithms and focused heuristics, e.g. bin packing or route planning. However, in practical work environments, constraints may change flexibly and it is often not clear what ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Robotics and AI
سال: 2019
ISSN: 2296-9144
DOI: 10.3389/frobt.2019.00105